Laplace Transforms via Hadamard Factorization

نویسندگان

  • Fuchang Gao
  • Jan Hannig
  • Tzong-Yow Lee
چکیده

Abstract. In this paper we consider the Laplace transforms of some random series, in particular, the random series derived as the squared L2 norm of a Gaussian stochastic process. Except for some special cases, closed form expressions for Laplace transforms are, in general, rarely obtained. It is the purpose of this paper to show that for many Gaussian random processes the Laplace transform can be expressed in terms of well understood functions using complex-analytic theorems on infinite products, in particular, the Hadamard Factorization Theorem. Together with some tools from linear differential operators, we show that in many cases the Laplace transforms can be obtained with little work. We demonstrate this on several examples. Of course, once the Laplace transform is known explicitly one can easily calculate the corresponding exact L2 small ball probabilities using Sytaja Tauberian theorem. Some generalizations are mentioned.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transient and Busy Period Analysis of the Gi/gi1 Queue as a Hilbert Factorization Problem

In this paper we find the waiting time distribution in the transient domain and the busy period distribution of the GI/G/I queue. We formulate the problem as a two-dimensional Lindley process and then transform it to a Hilbert factorization problem. We achieve the solution of the factorization problem for the GI/R/I, R/G/I queues, where R is the class of distributions with rational Laplace tran...

متن کامل

The Role of Super-Fast Transforms in Speeding Up Quantum Computations

We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While the fast transform algorithms reduce the number of operations needed in obtaining the transforms from O(2) to O(n2), quantum transforms are in comparison super-fast. The Quantum Fourier Transform can be performed in O(...

متن کامل

Laplace Transforms for Numericalinversion via Continued

It is often possible to e ectively calculate cumulative distribution functions and other quantities of interest by numerically inverting Laplace transforms. However, to do so it is necessary to compute the Laplace transform values. Unfortunately, convenient explicit expressions for required transforms are often unavailable. In that event, we show that it is sometimes possible to nd continued-fr...

متن کامل

Numerical pricing of discrete barrier and lookback options via Laplace transforms

URL: www.thejournalofcomputationalfinance.com Most contracts of barrier and lookback options specify discrete monitoring policies. However, unlike their continuous counterparts, discrete barrier and lookback options essentially have no analytical solution. For a broad class of models, including the classical Brownian model and jump-diffusion models, we show that the Laplace transforms of discre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003